A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem
نویسندگان
چکیده
This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand BHFSP, we will construct its mixed integer linear programming (MILP) model and use Gurobi solver to demonstrate correctness. Since BHFSP exists parallel machines in some processing stages, different decoding strategies can obtain makespan values for a given job sequence multiple assist algorithm find optimal value. In view of this, propose strategy that combines both forward backward select minimal objective function addition, decoding-assisted variant iterated greedy (VIG) solve above MILP model. The main novelties VIG are new reconstruction mechanism based on swap-based local reinforcement strategy, which enrich diversity solutions explore neighborhoods more deeply. evaluation is conducted against six state-of-the-art algorithms from literature. 100 tests showed average relative percentage increase (RPI) 1.00% 89.6% than comparison average, respectively. Therefore, suitable studied BHFSP.
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملan iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria
in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...
متن کاملAn Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem
We propose in this paper a Blocking Iterated Greedy algorithm (BIG) which makes an adjustment between two relevant destruction and construction stages to solve the blocking flow shop scheduling problem and minimize the maximum completion time (makespan). The greedy algorithm starts from an initial solution generated based on some well-known heuristic. Then, solutions are enhanced till some stop...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملA multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11112453